Shorter Queues for Permutation Routing on Meshes
نویسندگان
چکیده
New deterministic algorithms for routing permutations on an n n MIMD mesh are presented. They are very eecient in terms of the size of auxiliary memory at each processor, measured as the maximum number of packets that need to be queued. One algorithm runs in the optimal time 2 n ? 2 with a maximum queue length of 33. Another runs in the near-optimal time 2 n + O(1) with a maximum queue length of only 12. The attained queue sizes are less than half of the previously best queue bounds. The improvements in the queue sizes are due to a new general routing scheme, a better scattering algorithm, and a new technique called spreading.
منابع مشابه
An E cient Heuristic for Permutation Packet Routing on Meshes with Low Bu er Requirements
Even though exact algorithms exist for permutation routing of n messages on a n n mesh of processors which require constant size queues, the constants are very large and the algorithms very complicated to implement. In this paper, we present a novel, simple heuristic for the above problem. It uses constant and very small size queues ( size=2 ). For all the simulations we run on randomly generat...
متن کاملPermutation Routing and Sorting on Meshes with Row and Column Buses
We study the problems of permutation routing and sorting on several models of meshes with xed and reconngurable row and column buses. We describe two fast and fairly simple deterministic algorithms for permutation routing on two-dimensional networks, and a more complicated algorithm for multi-dimensional networks. The algorithms are obtained by converting two known oo-line routing schemes into ...
متن کاملRouting and Sorting on Meshes with Row and Column Buses
We give improved deterministic algorithms for permutation routing and sorting on meshes with row and column buses. Among our results, we obtain a fairly simple algorithm for permutation routing on two-dimensional meshes with buses that achieves a running time of n + o(n) and a queue size of 2. We also describe an algorithm for routing on r-dimensional networks with a running time of (2? 1=r)n+ ...
متن کاملExperimental Results for Four Work-Optimal PRAM Simulation Algorithms on Coated Meshes
In this paper we consider the eeect of overloading in four work-optimal PRAM simulation algorithms on coated meshes with P real processors. A coated mesh consists of a mesh connected routing machinery, and processor&memory pairs, which form a coat on the routing machinery. Previously work-optimal PRAM simulations, which ignore the eeect of overloading, has been presented for coated meshes, but ...
متن کاملDeterministic Permutation Routing on Meshes
New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On an n n array, one of them runs in the optimal 2 n ? 2 steps. It has maximum queue length 32. Another algorithm runs in near-optimal time, 2 n + O(1) steps, with a maximum queue length of only 12.
متن کامل